#pragma once
#include"BinaryTree.h"


typedef BTNode* QData;

typedef struct Queue
{
	QData q;
	struct Queue* next;
}Queue;


typedef struct Que
{
	Queue* head;
	Queue* tail;
}Que;


void QueueInit(Que* q);

void QueuePush(Que* q, QData x);

void QueuePop(Que* q);

QData QueueTop(Que* q);

bool QueueEmpty(Que* q);
